An Efficient Receiver Deniable Encryption Scheme and Its Applications

Deniable encryption is an important cryptographic primitive, essential in all cryptographic protocols where a coercive adversary comes to play with high potential. Deniable encryption plays a key role in the internet/electronic voting, electronic bidding, electronic auctions and secure multiparty computation. In this study a practical efficient receiver deniable encryption scheme based on BCP commitment scheme and idea of Klonowski et al. is proposed. The proposed scheme is a onemove scheme without any pre-encryption information required to be sent between the sender and the receiver prior to encryption. Moreover, the overhead is low in term of the size of the ciphertext. At the same time we compare the typical deniable encryption schemes with our proposed scheme. Finally, applying the proposed deniable encryption, we originally give a coercionresistant internet voting model without physical assumptions. We also compare the typical internet voting protocols with our proposed model.